منابع مشابه
Easy Sets Without Easy Small Subsets
We show the existence of relativized worlds relative to which there exist innnite polynomial-time computable sets without innnite polynomial-time computable sparse subsets or even non-deterministically polynomial-time computable sparse subsets. This result is tight since every innnite P set has an innnite sparse coNP subset.
متن کاملRobust Routing Made Easy
Designing routing schemes is a multidimensional and complex task that depends on the objective function, the computational model (centralized vs. distributed), and the amount of uncertainty (online vs. offline). Nevertheless, there are quite a few well-studied general techniques, for a large variety of network problems. In contrast, in our view, practical techniques for designing robust routing...
متن کاملRobust Bayes Point Machines
Support Vector Machines choose the hypothesis corresponding to the centre of the largest hypersphere that can be inscribed in version space. If version space is elongated or irregularly shaped a potentially superior approach is take into account the whole of version space. We propose to construct the Bayes point which is approximated by the centre of mass. Our implementation of a Bayes Point Ma...
متن کاملTally NP Sets and Easy Census Functions
We study the question of whether every P set has an easy (i.e., polynomialtime computable) census function. We characterize this question in terms of unlikely collapses of language and function classes such as #P1 ⊆ FP, where #P1 is the class of functions that count the witnesses for tally NP sets. We prove that every #P 1 function can be computed in FP #P #P1 1 . Consequently, every P set has ...
متن کاملComputing control invariant sets is easy
In this paper we consider the problem of computing control invariant sets for linear controlled systems with constraints on the input and on the states. We focus in particular on the complexity of the computation of the N-step operator, given by the Minkowski addition of sets, that is the basis of many of the iterative procedures for obtaining control invariant sets. Set inclusions conditions f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90138-8